Parameterized complexity dichotomy for Steiner Multicut
نویسندگان
چکیده
منابع مشابه
Parameterized Complexity Dichotomy for Steiner Multicut
We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = {T1, . . . , Tt}, Ti ⊆ V (G), of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that of each set Ti at least one pair of terminals is in different connected components of G \S. This problem generalizes several well-studied graph cut pr...
متن کاملParameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion
For two integers r, l ≥ 0, a graph G = (V,E) is an (r, l)graph if V can be partitioned into r independent sets and l cliques. In the parameterized (r, l)-Vertex Deletion problem, given a graph G and an integer k, one has to decide whether at most k vertices can be removed from G to obtain an (r, l)-graph. This problem is NP-hard if r+l ≥ 1 and encompasses several relevant problems such as Verte...
متن کاملTreewidth reduction for the parameterized Multicut problem
The parameterized Multicut problem consists in deciding, given a graph, a set of requests (i.e. pairs of vertices) and an integer k, whether there exists a set of k edges which disconnects the two endpoints of each request. Determining whether Multicut is Fixed-Parameter Tractable with respect to k is one of the most important open question in parameterized complexity [5]. We show that Multicut...
متن کاملComplexity of Steiner Tree in Split Graphs - Dichotomy Results
Given a connected graph G and a terminal set R ⊆ V (G), Steiner tree asks for a tree that includes all of R with at most r edges for some integer r ≥ 0. It is known from [ND12,Garey et. al [1]] that Steiner tree is NP-complete in general graphs. Split graph is a graph which can be partitioned into a clique and an independent set. K. White et. al [2] has established that Steiner tree in split gr...
متن کاملParameterized Complexity of Arc-Weighted Directed Steiner Problems
We start a systematic parameterized computational complexity study of three NP-hard network design problems on arc-weighted directed graphs: directed Steiner tree, strongly connected Steiner subgraph, and directed Steiner network. We investigate their parameterized complexities with respect to the three parameterizations: “number of terminals,” “an upper bound on the size of the connecting netw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2016
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2016.03.003